Which graphical models are difficult to learn?
نویسندگان
چکیده
We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-complexity algorithms systematically fail when the Markov random field develops long-range correlations. More precisely, this phenomenon appears to be related to the Ising model phase transition (although it does not coincide with it).
منابع مشابه
An Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کاملBedside Teaching in Undergraduate Medical Education: Issues, Strategies, and New Models for Better Preparation of New Generation Doctors
Bedside teaching is a vital component of medical education. It is applicable to any situation where teaching is imparted in the presence of patients. In teaching in the patients’ presence, learners have the opportunities to use all of their senses and learn the humanistic aspect of medicine such as role modeling, which is vital but difficult to communicate in words. Unfortunately, bedside teach...
متن کاملLearning Latent Groups with Hinge-loss Markov Random Fields
Probabilistic models with latent variables are powerful tools that can help explain related phenomena by mediating dependencies among them. Learning in the presence of latent variables can be difficult though, because of the difficulty of marginalizing them out, or, more commonly, maximizing a lower bound on the marginal likelihood. In this work, we show how to learn hinge-loss Markov random fi...
متن کاملLearning Graphical Models With Hypertree Structure Using a Simulated Annealing Approach
A major topic of recent research in graphical models has been to develop algorithms to learn them from a dataset of sample cases. However, most of these algorithms do not take into account that learned graphical models may be used for time-critical reasoning tasks and that in this case the time complexity of evidence propagation may have to be restricted, even if this can be achieved only by ac...
متن کاملTowards Robust Human-Robot Interaction using Multimodal Cues
Real-world domains characterized by partial observability and nondeterminism frequently make it difficult for a robot to operate without any human feedback. However, human participants are unlikely to have the time and expertise to provide elaborate and accurate feedback. The deployment of mobile robots to interact with humans in dynamic domains hence requires that the robot learn from multimod...
متن کامل